منابع مشابه
Efficient Partitioning of Sequences
Two trees are used sequentially to calculate an approxi-mation to lIA, where 1 IA < 2. These trees calculate the logarithm andexponential, and the division (reciprocation) process can be described by1/A= eAd. For bit skip accuracy of six to 10, this logarithmic-exponential method uses significantly less hardware with respect to thescheme in [3], and the delays may be...
متن کاملOptimal Partitioning of Sequences
The problem of partitioning a sequence of n real numbers into p intervals is considered. The goal is to find a partition such that the cost of the most expensive interval measured with a cost function f is minimized. An efficient algorithm which solves the problem in time O(p(n − p) log p) is developed. The algorithm is based on finding a sequence of feasible non-optimal partitions, each having...
متن کاملPreemptive Online Partitioning of Sequences
Online algorithms process their inputs piece by piece, taking irrevocable decisions for each data item. This model is too restrictive for most partitioning problems, since data that is yet to arrive may render it impossible to extend partial partitionings to the entire data set reasonably well. In this work, we show that preemption might be a potential remedy. We consider the problem of partiti...
متن کاملStreaming Partitioning of Sequences and Trees
We study streaming algorithms for partitioning integer sequences and trees. In the case of trees, we suppose that the input tree is provided by a stream consisting of a depth-first-traversal of the input tree. This captures the problem of partitioning XML streams, among other problems. We show that both problems admit deterministic (1+ )-approximation streaming algorithms, where a single pass i...
متن کاملMemory Efficient Minimum Substring Partitioning
Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de novo assembly algorithms makes it challenging to get the assembly done for higher eukaryotes like mammals. In this work, we investigate the memory i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1995
ISSN: 0018-9340
DOI: 10.1109/12.475128